Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое greatest common divisor - определение
LARGEST DIVISOR OF TWO INTEGERS OR POLYNOMIALS
Highest common factor; Greatest common denominator; Greatest common factor; Greatest Common Divisor; Common Factor; Highest common denominator; Common factor; Highest common divisor; Greatest Common Factor; NWD (mathematics); Q B Over M; B Q Over M; Common divisor; Greatest common measure
![ellipses]] (i.e. omission of dots due to the extremely high density).](https://commons.wikimedia.org/wiki/Special:FilePath/Greatest common divisor.png?width=200 "ellipses]] (i.e. omission of dots due to the extremely high density).")
Найдено результатов: 3133
greatest common divisor
<mathematics> (GCD) A function that returns the largest
positive integer that both arguments are integer multiples
of.
See also Euclid's Algorithm. Compare: {lowest common
multiple}.
(1999-11-02)
Greatest common divisor
In mathematics, the greatest common divisor (GCD) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers x, y, the greatest common divisor of x and y is denoted \gcd (x,y).
highest common factor
¦ noun the highest number that can be divided exactly into each of two or more numbers.
Polynomial greatest common divisor
GREATEST COMMON DIVISOR OF POLYNOMIALS
Greatest common divisior of two polynomials; Euclid's algorithm for polynomials; Greatest common divisor of two polynomials; Subresultant; Euclidean division of polynomials; Euclidean algorithm for polynomials; Pseudo-remainder sequence; Pseudo-remainder; Coprime polynomials
In algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials. This concept is analogous to the greatest common divisor of two integers.
The Greatest Generation (podcast)
A WEEKLY COMEDY STAR TREK PODCAST HOSTED BY ADAM PRANICA AND BENJAMIN HARRISON AND DISTRIBUTED ONLINE BY MAXIMUM FUN.
The Greatest Generation (Podcast); Greatest Generation (podcast); The Greatest Discovery (podcast); Drunk Shimoda; Greatest Gen; Greatest Discovery (podcast); Greatest Trek
The Greatest Generation is a weekly comedy Star Trek podcast hosted by Adam Pranica and Benjamin Harrison and distributed online by Maximum Fun. The show's tagline is "A Star Trek podcast by two guys who are a little bit embarrassed to have a Star Trek Podcast.
Greatest Hits (The Association album)
COMPILATION ALBUM BY THE ASSOCIATION
Greatest Hits (Association album)
Greatest Hits is the first compilation album by The Association, released in 1968 by Warner Bros. Records.
Greatest Hits (Robyn Hitchcock and The Egyptians album)
1996 COMPILATION ALBUM BY ROBYN HITCHCOCK AND THE EGYPTIANS
Greatest Hits (Robyn Hitchcock album)
Greatest Hits is a collection of material by Robyn Hitchcock and the Egyptians from the A&M period 1988-1992, spanning the albums Globe of Frogs, Queen Elvis, Perspex Island, and Respect.
Aliquant
![Plot of the number of divisors of integers from 1 to 1000. [[Prime number]]s have exactly 2 divisors, and [[highly composite number]]s are in bold.](https://commons.wikimedia.org/wiki/Special:FilePath/Highly composite numbers.svg?width=200 "Plot of the number of divisors of integers from 1 to 1000. [[Prime number]]s have exactly 2 divisors, and [[highly composite number]]s are in bold.")
INTEGER THAT WHOLLY DIVIDES ANOTHER INTEGER
Divisibility; Divides; Proper divisor; Proper factor; Divisors; Aliquant; Aliquot part; Aliquant divisor; Aliquot divisor; Divisible; ∣; Proper factors; Proper divisors; Draft:Divisibility rule for 14; Aliquant part; Trivial divisor; Non-trivial divisor; Evenly divisible; Nontrivial divisor
·adj An aliquant part of a number or quantity is one which does not divide it without leaving a remainder; thus, 5 is an aliquant part of 16. Opposed to aliquot.
Divisible
INTEGER THAT WHOLLY DIVIDES ANOTHER INTEGER
Divisibility; Divides; Proper divisor; Proper factor; Divisors; Aliquant; Aliquot part; Aliquant divisor; Aliquot divisor; Divisible; ∣; Proper factors; Proper divisors; Draft:Divisibility rule for 14; Aliquant part; Trivial divisor; Non-trivial divisor; Evenly divisible; Nontrivial divisor
·noun A divisible substance.
II. Divisible ·adj Capable of being divided or separated.
Divisor
INTEGER THAT WHOLLY DIVIDES ANOTHER INTEGER
Divisibility; Divides; Proper divisor; Proper factor; Divisors; Aliquant; Aliquot part; Aliquant divisor; Aliquot divisor; Divisible; ∣; Proper factors; Proper divisors; Draft:Divisibility rule for 14; Aliquant part; Trivial divisor; Non-trivial divisor; Evenly divisible; Nontrivial divisor
In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a multiple of m.
Википедия
Greatest common divisor
In mathematics, the greatest common divisor (GCD) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers x, y, the greatest common divisor of x and y is denoted . For example, the GCD of 8 and 12 is 4, that is, .
In the name "greatest common divisor", the adjective "greatest" may be replaced by "highest", and the word "divisor" may be replaced by "factor", so that other names include highest common factor (hcf), etc. Historically, other names for the same concept have included greatest common measure.
This notion can be extended to polynomials (see Polynomial greatest common divisor) and other commutative rings (see § In commutative rings below).
